On the Complexity of Perfect Models of Logic Programs
نویسنده
چکیده
In this paper we investigate computational complexity of the PERF-consistency and PERF-entailment problems for ground normal logic programs. In [3] it is proved that these problems belong to Σ2 and Π P 2 correspondingly. The question of obtaining more accurate results was left as open. We prove that both problems belong to ∆2 . Lower bounds on the complexity of these problems are also established in terms of a new complexity class D2 which is a subset of ∆2 . It is shown that PERF-consistency is a D2-complete problem and PERF-entailment is co-D2-complete.
منابع مشابه
Logic regression and its application in predicting diseases
Regression is one of the most important statistical tools in data analysis and study of the relationship between predictive variables and the response variable. in most issues, regression models and decision tress only can show the main effects of predictor variables on the response and considering interactions between variables does not exceed of two way and ultimately three-way, due to co...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملA Perfect Specialization Model for Gravity Equation in Bilateral Trade based on Production Structure
Although initially originated as a totally empirical relationship to explain the volume of trade between two partners, gravity equation has been the focus of several theoretic models that try to explain it. Specialization models are of great importance in providing a solid theoretic ground for gravity equation in bilateral trade. Some research papers try to improve specialization models by addi...
متن کاملPropose, Analysis and Simulation of an All Optical Full Adder Based on Plasmonic Waves using Metal-Insulator-Metal Waveguide Structure
This paper proposes a full adder with minimum power consumption and lowloss with a central frequency of 1550nm using plasmonic Metal-Insulator-Metal (MIM)waveguide structure and rectangular cavity resonator. This full adder operates based onXOR and AND logic gates. In this full adder, the resonant wave composition of the firstand second modes has been used and we have ob...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 39 شماره
صفحات -
تاریخ انتشار 1999